Trinary tools for continuously valued binary classifiers
نویسندگان
چکیده
Classification methods for binary (yes/no) tasks often produce a continuously valued score. Machine learning practitioners must perform model selection, calibration, discretization, performance assessment, tuning, and fairness assessment. Such involve examining classifier results, typically using summary statistics manual examination of details. In this paper, we provide an interactive visualization approach to support such continuously-valued tasks. Our addresses the three phases these tasks: operating point examination. We enhance standard views introduce task-specific so that they can be integrated into multi-view coordination (MVC) system. build on existing comparison-based approach, extending it continuous classifiers by treating values as trinary (positive, unsure, negative) even if will not ultimately use 3-way classification. cases demonstrate how our enables machine accomplish key
منابع مشابه
Value Difference Metrics for Continuously Valued Attributes
Nearest neighbor and instance-based learning techniques typically handle continuous and linear input values well, but often do not handle symbolic input attributes appropriately. The Value Difference Metric (VDM) was designed to find reasonable distance values between symbolic attribute values, but it largely ignores continuous attributes, using discretization to map continuous values into symb...
متن کاملEffective Pedestrian Detection Using Center-symmetric Local Binary/Trinary Patterns
Accurately detecting pedestrians in images plays a critically important role in many computer vision applications. Extraction of effective features is the key to this task. Promising features should be discriminative, robust to various variations and easy to compute. In this work, we present novel features, termed dense center-symmetric local binary patterns (CS-LBP) and pyramid center-symmetri...
متن کاملProphit: Causal inverse classification for multiple continuously valued treatment policies
Inverse classication uses an induced classier as a queryable oracle to guide test instances towards a preferred posterior class label. e result produced from the process is a set of instance-specic feature perturbations, or recommendations, that optimally improve the probability of the class label. In this work, we adopt a causal approach to inverse classication, eliciting treatment polici...
متن کاملBRACE: A Paradigm For the Discretization of Continuously Valued Data
Discretization of continuously valued data is a useful and necessary tool because many learning paradigms assume nominal data. A list of objectives for efficient and effective discretization is presented. A paradigm called BRACE (Boundary Ranking And Classification Evaluation) that attempts to meet the objectives is presented along with an algorithm that follows the paradigm. The paradigm meets...
متن کاملDeconstructing Cross-Entropy for Probabilistic Binary Classifiers
In this work, we analyze the cross-entropy function, widely used in classifiers both as a performance measure and as an optimization objective. We contextualize cross-entropy in the light of Bayesian decision theory, the formal probabilistic framework for making decisions, and we thoroughly analyze its motivation, meaning and interpretation from an information-theoretical point of view. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Visual Informatics
سال: 2022
ISSN: ['2468-502X', '2543-2656']
DOI: https://doi.org/10.1016/j.visinf.2022.04.002